On Generating Small Clause Normal Forms
نویسندگان
چکیده
In this paper we focus on two powerful techniques to obtain compact clause normal forms: Renaming of formulae and reened Skolem-ization methods. We illustrate their eeect on various examples. By an exhaustive experiment of all rst-order TPTP problems, it shows that our clause normal form transformation yields fewer clauses and fewer literals than the methods known and used so far. This often allows for exponentially shorter proofs and, in some cases, it makes it even possible for a theorem prover to nd a proof where it was unable to do so with more standard clause normal form transformations.
منابع مشابه
A Hiking Trip Through the Orders of 1 Magnitude : Deriving Efficient Generators for 2 Closed Simply - Typed Lambda Terms and 3 Normal Forms
Contrary to several other families of lambda terms, no closed 9 formula or generating function is known and none of the sophisticated 10 techniques devised in analytic combinatorics can help with counting or 11 generating the set of simply-typed closed lambda terms of a given size. 12 Moreover, their asymptotic scarcity among the set of closed lambda 13 terms makes counting them via brute force...
متن کاملA Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms
Contrary to several other families of lambda terms, no closed formula or generating function is known and none of the sophisticated techniques devised in analytic combinatorics can currently help with counting or generating the set of simply-typed closed lambda terms of a given size. Moreover, their asymptotic scarcity among the set of closed lambda terms makes counting them via brute force gen...
متن کاملOn Variables with Few Occurrences in Conjunctive Normal Forms
We consider the question of the existence of variables with few occurrences in boolean conjunctive normal forms (clause-sets). Let μvd(F ) for a clause-set F denote the minimal variable-degree, the minimum of the number of occurrences of variables. Our main result is an upper bound μvd(F ) ≤ nM(σ(F )) ≤ σ(F ) + 1 + log 2 (σ(F )) for lean clause-sets F in dependency on the surplus σ(F ). Lean cl...
متن کاملConstraint satisfaction problems in clausal form
This is the report-version of a mini-series of two articles [60, 61] on the foundations of conjunctive normal forms with non-boolean variables. These two parts are here bundled in one report, each part yielding a chapter. Part I We consider the problem of generalising boolean formulas in conjunctive normal form by allowing non-boolean variables, with the goal of maintaining combinatorial proper...
متن کامل